Partitioned bloom filter merge for massively parallel processing clustered data management

ABSTRACT

A computer-implemented method for a partitioned bloom filter merge is provided. A non-limiting example of the computer-implemented method includes partitioning, by a processing device, a bloom filter into N equal size filter partitions. The method further includes distributing, by the processing device, each of the filter partitions to an associated node. The method further includes merging, by the processing device, the filter partitions in each of the associated nodes. The method further includes redistributing, by the processing device, the merged filter partitions to each of the N nodes. The method further includes joining, by the processing device, the merged filter partitions in each of the N nodes to assemble a complete merged bloom filter.

DOMESTIC PRIORITY

This application is a continuation of U.S. patent application Ser. No.15/790,537, filed Oct. 23, 2017, the disclosure of which is incorporatedby reference herein in its entirety.

BACKGROUND

The present invention generally relates to data processing, and morespecifically, to partitioned bloom filter merge for massively parallelprocessing clustered data management.

Bloom filters are a compact data structure used to efficiently determinewhether a value belongs to a set or not. Bloom filters can be used indatabases to perform early filtering of probe values in join operationsto reduce processing costs and memory consumption.

SUMMARY

Embodiments of the present invention are directed to acomputer-implemented method for a partitioned bloom filter merge. Anon-limiting example of the computer-implemented method includespartitioning, by a processing device, a bloom filter into N equal sizefilter partitions. The method further includes distributing, by theprocessing device, each of the filter partitions to an associated node.The method further includes merging, by the processing device, thefilter partitions in each of the associated nodes. The method furtherincludes redistributing, by the processing device, the merged filterpartitions to each of the N nodes. The method further includes joining,by the processing device, the merged filter partitions in each of the Nnodes to assemble a complete merged bloom filter.

Embodiments of the present invention are also directed to a system and acomputer program product for a partitioned bloom filter merge.

Additional technical features and benefits are realized through thetechniques of the present invention. Embodiments and aspects of theinvention are described in detail herein and are considered a part ofthe claimed subject matter. For a better understanding, refer to thedetailed description and to the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The specifics of the exclusive rights described herein are particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The foregoing and other features and advantages ofthe embodiments of the invention are apparent from the followingdetailed description taken in conjunction with the accompanying drawingsin which:

FIG. 1 depicts a cloud computing environment according to aspects of thepresent disclosure;

FIG. 2 depicts abstraction model layers according to aspects of thepresent disclosure;

FIG. 3 depicts a processing system for implementing the techniquesdescribed herein according to aspects of the present disclosure; and

FIG. 4 depicts a block diagram of a bloom filter implementationaccording to aspects of the present disclosure;

FIG. 5 depicts a block diagram of a multi-node cluster that distributesthe build side and the probe side across the nodes of the cluster,according to aspects of the present disclosure;

FIG. 6 depicts a block diagram of a multi-node cluster that distributesthe build side and the probe side across the nodes of the cluster,according to aspects of the present disclosure;

FIG. 7 depicts a block diagram of a multi-node cluster that distributedthe build side and the probe side across the nodes of the cluster usinga partitioned bloom filter merge, according to aspects of the presentdisclosure;

FIG. 8 depicts a flow diagram of a method for performing a partitionbloom filter merge, according to aspects of the present disclosure; and

FIG. 9 depicts a flow diagram of a method for performing a partitionbloom filter merge, according to aspects of the present disclosure.

The diagrams depicted herein are illustrative. There can be manyvariations to the diagram or the operations described therein withoutdeparting from the spirit of the invention. For instance, the actionscan be performed in a differing order or actions can be added, deletedor modified. Also, the term “coupled” and variations thereof describeshaving a communications path between two elements and does not imply adirect connection between the elements with no interveningelements/connections between them. All of these variations areconsidered a part of the specification.

In the accompanying figures and following detailed description of thedisclosed embodiments, the various elements illustrated in the figuresare provided with two or three digit reference numbers. With minorexceptions, the leftmost digit(s) of each reference number correspond tothe figure in which its element is first illustrated.

DETAILED DESCRIPTION

Various embodiments of the invention are described herein with referenceto the related drawings. Alternative embodiments of the invention can bedevised without departing from the scope of this invention. Variousconnections and positional relationships (e.g., over, below, adjacent,etc.) are set forth between elements in the following description and inthe drawings. These connections and/or positional relationships, unlessspecified otherwise, can be direct or indirect, and the presentinvention is not intended to be limiting in this respect. Accordingly, acoupling of entities can refer to either a direct or an indirectcoupling, and a positional relationship between entities can be a director indirect positional relationship. Moreover, the various tasks andprocess steps described herein can be incorporated into a morecomprehensive procedure or process having additional steps orfunctionality not described in detail herein.

The following definitions and abbreviations are to be used for theinterpretation of the claims and the specification. As used herein, theterms “comprises,” “comprising,” “includes,” “including,” “has,”“having,” “contains” or “containing,” or any other variation thereof,are intended to cover a non-exclusive inclusion. For example, acomposition, a mixture, process, method, article, or apparatus thatcomprises a list of elements is not necessarily limited to only thoseelements but can include other elements not expressly listed or inherentto such composition, mixture, process, method, article, or apparatus.

Additionally, the term “exemplary” is used herein to mean “serving as anexample, instance or illustration.” Any embodiment or design describedherein as “exemplary” is not necessarily to be construed as preferred oradvantageous over other embodiments or designs. The terms “at least one”and “one or more” may be understood to include any integer numbergreater than or equal to one, i.e. one, two, three, four, etc. The terms“a plurality” may be understood to include any integer number greaterthan or equal to two, i.e. two, three, four, five, etc. The term“connection” may include both an indirect “connection” and a direct“connection.”

The terms “about,” “substantially,” “approximately,” and variationsthereof, are intended to include the degree of error associated withmeasurement of the particular quantity based upon the equipmentavailable at the time of filing the application. For example, “about”can include a range of ±8% or 5%, or 2% of a given value.

For the sake of brevity, conventional techniques related to making andusing aspects of the invention may or may not be described in detailherein. In particular, various aspects of computing systems and specificcomputer programs to implement the various technical features describedherein are well known. Accordingly, in the interest of brevity, manyconventional implementation details are only mentioned briefly herein orare omitted entirely without providing the well-known system and/orprocess details.

It is to be understood that although this disclosure includes a detaileddescription on cloud computing, implementation of the teachings recitedherein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g., networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported, providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure that includes anetwork of interconnected nodes.

Referring now to FIG. 1, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 includes one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 1 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 2, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 1) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 2 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provides pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and a partitioned bloom filter merge 96.

It is understood that embodiments of the present invention are capableof being implemented in conjunction with any other suitable type ofcomputing environment now known or later developed. For example, FIG. 3illustrates a block diagram of a processing system 300 for implementingthe techniques described herein. In examples, processing system 300 hasone or more central processing units (processors) 321 a, 321 b, 321 c,etc. (collectively or generically referred to as processor(s) 321 and/oras processing device(s)). In aspects of the present disclosure, eachprocessor 321 may include a reduced instruction set computer (RISC)microprocessor. Processors 321 are coupled to system memory (e.g.,random access memory (RAM) 324) and various other components via asystem bus 333. Read only memory (ROM) 322 is coupled to system bus 333and may include a basic input/output system (BIOS), which controlscertain basic functions of processing system 300.

Further illustrated are an input/output (I/O) adapter 327 and acommunications adapter 326 coupled to system bus 333. I/O adapter 327may be a small computer system interface (SCSI) adapter thatcommunicates with a hard disk 323 and/or a tape storage drive 325 or anyother similar component. I/O adapter 327, hard disk 323, and tapestorage device 325 are collectively referred to herein as mass storage334. Operating system 340 for execution on processing system 300 may bestored in mass storage 334. A network adapter 326 interconnects systembus 333 with an outside network 336 enabling processing system 300 tocommunicate with other such systems.

A display (e.g., a display monitor) 335 is connected to system bus 333by display adaptor 332, which may include a graphics adapter to improvethe performance of graphics intensive applications and a videocontroller. In one aspect of the present disclosure, adapters 326, 327,and/or 332 may be connected to one or more I/O busses that are connectedto system bus 333 via an intermediate bus bridge (not shown). SuitableI/O buses for connecting peripheral devices such as hard diskcontrollers, network adapters, and graphics adapters typically includecommon protocols, such as the Peripheral Component Interconnect (PCI).Additional input/output devices are shown as connected to system bus 333via user interface adapter 328 and display adapter 332. A keyboard 329,mouse 330, and speaker 331 may be interconnected to system bus 333 viauser interface adapter 328, which may include, for example, a Super I/Ochip integrating multiple device adapters into a single integratedcircuit.

In some aspects of the present disclosure, processing system 300includes a graphics processing unit 337. Graphics processing unit 337 isa specialized electronic circuit designed to manipulate and alter memoryto accelerate the creation of images in a frame buffer intended foroutput to a display. In general, graphics processing unit 337 is veryefficient at manipulating computer graphics and image processing and hasa highly parallel structure that makes it more effective thangeneral-purpose CPUs for algorithms where processing of large blocks ofdata is done in parallel.

Thus, as configured herein, processing system 300 includes processingcapability in the form of processors 321, storage capability includingsystem memory (e.g., RAM 24), and mass storage 334, input means such askeyboard 329 and mouse 330, and output capability including speaker 331and display 335. In some aspects of the present disclosure, a portion ofsystem memory (e.g., RAM 324) and mass storage 334 collectively store anoperating system such as the AIX® operating system from IBM Corporationto coordinate the functions of the various components shown in theprocessing system 300.

Turning now to an overview of technologies that are more specificallyrelevant to aspects of the disclosure, techniques for a partitionedbloom filter merge for massively parallel processing clustered datamanagement is provided. In a massively parallel processing (MPP)clustered database, a probe side of a join (e.g., a distributed hashjoin) can be shipped across a network to the build side. Bloom filterscan be used to perform filtering of the probe data at the source (i.e.,the probe side) prior to sending the data over the network back to thebuild side. FIG. 4 depicts a block diagram of a bloom filterimplementation 400 according to aspects of the present disclosure.According to an example, the bloom filter implementation 400 can be usedto perform a distributed join for a partitioned database. The build side401 creates a filter (e.g., a bloom filter) that is used by the probeside 402 to filter data before sending the data back to the build side401. Once the build side creates the filter, the filter is shipped tothe probe side 402 over a network 403, and the probe side 402 filtersrows from a database based on the filter. The filtered rows from thedatabase are then shipped back to the build side 401 over the network403. This can greatly reduce the amount of network traffic generated byjoin processing when the filter size is relatively small compared to thevolume of the probe values and pay load. For example, only the filteredrows are shipped back, reducing the amount of network traffic

While it may be desirable to perform this type of remote filtering onthe probe side 402, it can become problematic in cases where the probeside 402 is being broadcast to many nodes on a cluster. This can resultin filters also needing to be broadcast from the build side 401 andmerged together to be applied against the probe data on each nodehosting the probe side 402 and/or build side 401. This can cause theamount of filter data that needs to be shipped over the network 403 togrow exponentially (e.g., when using a point-to-point protocol such asTCP/IP) and thereby render the strategy ineffective for large clustersand/or large filters.

For example, FIG. 5 depicts a block diagram of a multi-node cluster 500that distributes the build side 401 and the probe side 402 across thenodes of the cluster, according to aspects of the present disclosure.When a join is performed in the cluster 500 using a bloom filter, alarge amount of network traffic is generated that can cause networkcongestion and latency. In this example, a 1 MB filter (e.g., filter 501a, 501 b, 501 c, 501 d . . . 501 n (collectively “filter 501”)) is builtfrom table data on each node (e.g., node 1, node 2, node 3, node 4 . . .node 1000) in the cluster 500. The 1 MB filter 501 is broadcast to everyother node in the cluster. For example, node 1 broadcasts to node 2,node 3, node 4 . . . node 1000; node 2 broadcasts to node 1, node 3,node 4 . . . node 1000; etc. Assuming each node connects to every othernode in the cluster 500 (e.g., through a standard TCP/IP socket), thetotal network traffic generated is 1 MB*999 (e.g., from one node to theother 999 nodes in the cluster 500)*1000 (total number nodes in thecluster 500) or close to 1 TB of data. This is even though each nodemerges the filters 501 bitwise into a single 1 MB filter in order tokeep the memory footprint of filters manageable.

This exponential growth characteristic of the cluster 500 effectivelyeliminates the ability to apply filtering for broadcast outer joinswhich limits the number of plan choices available for performing joinprocessing in large clusters. A similar problem occurs when the filteris built on the join probe side in order to reduce the number of rowsthat may be broadcast from a large join builds side.

Although various approaches have been attempted to reduce networktraffic in such situations, these approaches are ineffective and/orproblematic. For example, one possible approach for avoiding theexponential network traffic is to implement network communications usingthe UDP protocol, which enables network broadcasting of filters.However, this approach is disadvantageous because it requires thedatabase to implement a reliability layer on top of UDP which adds toproduct complexity and software maintenance and because relying on anetwork broadcast model precludes the database system from leveraginghardware or features that operate only on a point-to-point basis (e.g.,SSL encryption, RDMA optimized communications, etc.).

Another possible approach for avoiding the exponential network trafficis to nominate one node as a victim node that receives all the filtersand performs the filtering. However, this can cause a bottleneck effectat the victim node and can introduce additional latency into the system.

FIG. 6 depicts a multi-node cluster 600 that distributes the build sideand the probe side across the nodes of the cluster, according to aspectsof the present disclosure. The multi-node cluster 600 includes threenodes: node 1, node 2, and node 3. Each node includes a 1 MB filter(e.g., node 1 includes a 1 MB filter 601 a, node 2 includes a 1 MBfilter 601 b, and node 3 includes a 1 MB filter 601 c). The filters 601a, 601 b, 601 c are collectively referred to as “filters 601.” Thefilters 601 are distributed from each node to the other nodes over anetwork (e.g., the network 403) as depicted by the arrows in FIG. 6.

Network usage (i.e., the amount of bandwidth consumed in the network asa result of the transferred filters) is a product of the filter size andthe number of nodes. For example, network usage is calculated bymultiplying the filter size by the number of nodes and by the number ofnodes minus one (e.g., 1 MB*3*(3−1)=6 MB). As the number of nodesincreases, the network usage increases exponentially. For example, a 1MB filter size in a four-node cluster would be 12 MB (i.e., 1MB*4*(4−1)) and a 1 MB filter size in a five-node cluster would be 20 MB(i.e., 1 MB*5*(5−1)).

The present techniques address the above-described problems by reducingnetwork usage when the filter is transmitted between nodes byimplementing a partitioned bloom filter merge. That is, the presenttechniques transmit the filter by partitioning the filter, distributingthe filter partitions, merging the filter partitions, redistributing themerged filter partitions, and joining the merged filter partitions toregenerate the bloom filter.

In particular, the present techniques provide for handling the casewhere bloom filters need to be broadcast from each node in a cluster toevery other node and then merged on the receiving end on each node intoa single filter to apply against a data set partitioned across thosenodes. As mentioned a common use case for this scenario would be whenperforming filtering on a broadcast outer join operation in adistributed database system. The present approach provides advantagesover existing techniques in that it eliminates the exponential networktraffic growth characteristic and reduces the net cost of the mergeprocessing across the cluster.

Generally, aspects of the present disclosure operate by partitioning thesource filter produced by each node into N equal size ranges where N isthe number of nodes in the cluster. Each node then enumerates the rangesusing a common ordering and sends each range in order to a differentnode in the cluster. Leveraging the common ordering, each node receivesall the filters for a given range, merges them together, and thenbroadcasts the final merged filter range to all nodes. Each node as afinal step then assembles or joins (e.g., concatenates) the mergedranges together into a complete merged filter which can be applied toeach node's local dataset.

With this partitioned merge technique, the total network traffic forbroadcasting and merging an M byte filter is (M/N)*(N−1)*N bytes foreach node to distribute the partitioned filter to all other nodes formerging and another (M/N)*(N−1)*N bytes to broadcast the merged rangesto all other nodes in the cluster for a total of 2*M*(N−1) bytesshipped.

This represents a savings of a factor of N in network traffic overexisting techniques. According to an example of broadcasting and merginga 1 MB filter to 1000 nodes, the present techniques generate just under2 GB of network traffic rather than 1 TB when exchanging filtersaccording to the example described above with respect to FIG. 5. Inaddition, the present techniques provide a divide and conquer strategyfor merging the filter, which results in a reduction of the processingcost of the merge by a factor of N across the cluster as each node nowavoids any redundant merge processing.

FIG. 7 depicts a block diagram of a multi-node cluster 700 thatdistributed the build side and the probe side across the nodes of thecluster using a partitioned bloom filter merge, according to aspects ofthe present disclosure. The multi-node cluster 700 includes three nodes:node 1, node 2, and node 3. Each node includes a 1 MB filter (e.g., node1 includes a 1 MB filter 701 a, node 2 includes a 1 MB filter 701 b, andnode 3 includes a 1 MB filter 701 c). The filters 701 a, 701 b, 701 care collectively referred to as “filters 701.” The filters 701 aredistributed from each node to the other nodes over a network (e.g., thenetwork 403) as depicted by the arrows in FIG. 7.

FIG. 7 shows that the partitioned bloom filter merge includes, forexample, 3 steps with two “hops” or transfers of the filters 701occurring between the steps. During step 1, each of the nodes partitionstheir respective filters 701 into N equal size filter partitions where Nrepresents the number of nodes (e.g., 3 nodes in the example of FIG. 7).For example, the filter 701 a is partitioned into three equal sizefilter partitions 701 a 1, 701 a 2, and 701 a 3; the filter 701 b ispartitioned into three equal size filter partitions 701 b 1, 701 b 2,and 701 b 3; and the filter 701 c is partitioned into three equal sizefilter partitions 701 c 1, 701 c 2, and 701 c 3.

During a first hop or transfer between step 1 and step 2, the filterpartitions are distributed to a node associated with each filterpartition. For example, each of the filter partitions 701 a 1, 701 b 1,and 701 c 1 are distributed to node 1, each of the filter partitions 701a 2, 701 b 2, and 701 c 2 are distributed to node 2, and each of thefilter partitions 701 a 3, 701 b 3, and 701 c 3 are distributed to node3. The nodes 1, 2, 3 then each merge the filter partitions. For example,node 1 merges the filter partitions 701 a 1, 701 b 1, and 701 c 1 into amerged filter partition 701 d 1. Similarly, node 2 merges the filterpartitions 701 a 2, 701 b 2, and 701 c 2 into a merged filter partition701 d 2, and node 3 merges the filter partitions 701 a 3, 701 b 3, and701 c 3 into a merged filter partition 701 d 3.

The merge can occur using a bit map merge by applying an “or” operationbetween each part of the filter partition. For example in node 1 duringthe second step, filter 701 a 1 is OR′d with filter 701 b 1 and theresult is OR′d with filter 701 c 1 to produce the merged filter 701 d 1.This effectively retains each part of the filter partition within eachnode while producing a merged filter partition that is the same size asthe individual filter partitions. For example, if each filter partition701 a 1, 701 b 1, 701 c 1 is 1 MB/3, then the merged filter partition isalso 1 MB/3. During a second hop or transfer between step 2 and step 3,the merged filter partitions are redistributed to each of the nodes. Thenodes then join the merged filter partitions to reassemble the bloomfilter.

Because the bloom filter is merged in step 2 using a bitmap to retaineach part of the filter partition to produce a merged filter partitionthat is the same size as the individual filter partitions, network usageis drastically reduced, thereby improving performance of the processingsystem using the bloom filter (such as for a distributed hash joinoperation). During the first hop, the network usage is equal to the sizeof the filter divided by the number of nodes times the number of nodestimes the number of nodes minus 1. For example, for a 1 MB filter, thenetwork usage during the first hop is 1 MB/3*3*(3−1)=2 MB. Similarly,during the second hop, the network usage is equal to the size of thefilter divided by the number of nodes times the number of nodes timesthe number of nodes minus 1. For the example 1 MB filter, the networkusage during the second hop is 1 MB/3*3*(3−1)=2 MB. Accordingly, thetotal network usage is the sum of the two hops (e.g., 2 MB+2 MB=4 MB).This is a drastic reduction in network usage from direct filtertransmissions, as illustrated in FIG. 6. Accordingly, the functioning ofprocessing system implementing this technique is improved by reducingnetwork traffic, network latency, and the like. As the number of nodesgrows, the network usage grows at a much slower pace than existingsolutions.

FIG. 8 depicts a flow diagram of a method 800 for performing a partitionbloom filter merge, according to aspects of the present disclosure. Themethod 800 can be implemented, for example, by the processing system 300of FIG. 3, in the cloud computing environment 50 of FIG. 1, or by anyother suitable processing system or device.

At block 802, the processing system partitions a bloom filter into Nequal size filter partitions, where N is equal to a number of nodes in adistributed database system. At block 804, the processing systemdistributes each of the filter partitions to an associated node. Atblock 806, the processing system merges the filter partitions in each ofthe associated nodes. At block 808, the processing system redistributesthe merged filter partitions to each of the N nodes. At block 810, theprocessing system joins the merged filter partitions in each of the Nnodes to assemble a complete merged bloom filter.

Additional processes also may be included, and it should be understoodthat the processes depicted in FIG. 8 represent illustrations and thatother processes may be added or existing processes may be removed,modified, or rearranged without departing from the scope and spirit ofthe present disclosure.

FIG. 9 depicts a flow diagram of a method 900 for performing a partitionbloom filter merge, according to aspects of the present disclosure. Themethod 900 can be implemented, for example, by the processing system 300of FIG. 3, in the cloud computing environment 50 of FIG. 1, or by anyother suitable processing system or device.

At block 901, the processing system generates a bloom filter to filterdata in a distributed database system. The bloom filter can be generatedas part of a join operation, such as a distributed hash join operation,for example.

At block 902, the processing system partitions a bloom filter into Nequal size filter partitions, where N is equal to a number of nodes inthe distributed database system. At block 904, the processing systemdistributes each of the filter partitions to an associated node. Atblock 906, the processing system merges the filter partitions in each ofthe associated nodes. At block 908, the processing system redistributesthe merged filter partitions to each of the N nodes. At block 910, theprocessing system joins the merged filter partitions in each of the Nnodes to assemble a complete merged bloom filter.

At block 912, the processing system filters the data using thereassembled bloom filter. For example, the bloom filter can be appliedto filter rows of the database. At block 914, the processing systemreturns the filter data to enable an operation to be performed (e.g., adistributed hash join operation) using the filtered data.

Additional processes also may be included, and it should be understoodthat the processes depicted in FIG. 9 represent illustrations and thatother processes may be added or existing processes may be removed,modified, or rearranged without departing from the scope and spirit ofthe present disclosure.

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instruction by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdescribed herein.

What is claimed is:
 1. A computer-implemented method comprising:partitioning, by a processing device, a bloom filter at each node of aplurality of nodes into N equal size filter partitions, wherein N is thenumber of the plurality of nodes; distributing, by the processingdevice, each of the filter partitions among the plurality of nodes suchthat each node of the plurality of nodes is associated with one of thefilter partitions from each of the plurality of nodes; merging, by theprocessing device, the filter partitions in each of the plurality ofnodes; redistributing, by the processing device, the merged filterpartitions to each of the plurality of nodes; and joining, by theprocessing device, the merged filter partitions in each of the pluralityof nodes to assemble a complete merged bloom filter.
 2. Thecomputer-implemented method of claim 1, wherein the filter partitionsare bitmaps, and wherein merging the filter partitions comprisesperforming a bitmap merge on the bitmaps.
 3. The computer-implementedmethod of claim 2, wherein performing the bitmap merge comprisesapplying an OR operation on the bitmaps.
 4. The computer-implementedmethod of claim 1, further comprising generating the bloom filter tofilter data in a distributed database system prior to partitioning thebloom filter.
 5. The computer-implemented method of claim 1, furthercomprising filtering the data using the complete merged bloom filter byapplying the complete merged bloom filter to a data table to filter rowsof data based on the filter.
 6. The computer-implemented method of claim5, further comprising using the filtered data to perform an operation.